Comprehending anaphoric presuppositions involves memory retrieval too

Comprehending anaphoric metaphors.

In this study we investigate the comprehension of various kinds of anaphoric metaphors in context. We describe an experiment that manipulated the metaphoricity of simple noun + verb + ending sentences by using either a metaphoric noun or a metaphoric verb or both. Our results show that metaphoric nouns affect sentence comprehension to a greater extent than do metaphoric verbs. Thus, even though...

Introduction 2 Quantifier Dependent Readings of Anaphoric Presuppositions

Presuppositions Can Be Disruptors Too: A Case against Strawson-Entailment

This paper has one main goal, which is a negative one. It aims at showing that the theory of NPI licensing defended in von Fintel (1999) is empirically inadequate. In essence, the theory we’re discussing relies on so-called Strawson-entailment, a device which ensures that weak NPIs are licensed despite the presence of presuppositions. We level two main criticisms against von Fintel’s theory. Fi...

On-line Reference Assignment for Anaphoric and Non-Anaphoric Nouns: A Unified, Memory-Based Model in ACT-R

The computational model in present paper confirms that memory-based accounts are sufficient to account for a high rate of success at first-pass referent retrieval for anaphoric (and non-anaphoric) nouns. Because even definite noun phrases can often be non-anaphoric (e.g., Poesio & Vieira, 1998), an adequate model must account for how a reader makes an explicit or implicit decision about the ana...

Comprehending ADTs*

We show how to generalize list comprehensions to work on abstract data types. First, we make comprehension notation automatically available for any data type that is specified as a constructor/destructor-pair (bialgebra). Second, we extend comprehensions to enable the use of different types in one comprehension and to allow to map between different types. Third, we refine the translation of com...